Network Morphism

نویسندگان

  • Tao Wei
  • Changhu Wang
  • Yong Rui
  • Chang Wen Chen
چکیده

We present in this paper a systematic study on how to morph a well-trained neural network to a new one so that its network function can be completely preserved. We define this as network morphism in this research. After morphing a parent network, the child network is expected to inherit the knowledge from its parent network and also has the potential to continue growing into a more powerful one with much shortened training time. The first requirement for this network morphism is its ability to handle diverse morphing types of networks, including changes of depth, width, kernel size, and even subnet. To meet this requirement, we first introduce the network morphism equations, and then develop novel morphing algorithms for all these morphing types for both classic and convolutional neural networks. The second requirement for this network morphism is its ability to deal with nonlinearity in a network. We propose a family of parametric-activation functions to facilitate the morphing of any continuous non-linear activation neurons. Experimental results on benchmark datasets and typical neural networks demonstrate the effectiveness of the proposed network morphism scheme.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

MAXIMAL PRYM VARIETY AND MAXIMAL MORPHISM

We investigated maximal Prym varieties on finite fields by attaining their upper bounds on the number of rational points. This concept gave us a motivation for defining a generalized definition of maximal curves i.e. maximal morphisms. By MAGMA, we give some non-trivial examples of maximal morphisms that results in non-trivial examples of maximal Prym varieties.

متن کامل

Graph Abstraction and Abstract Graph Transformations (Amended Version)

Many important systems such as concurrent heap-manipulating programs, communication networks, or distributed algorithms, are hard to verify due to their inherent dynamics and unboundedness. Graphs are an intuitive representation for the states of these systems, where transitions can be conveniently described by graph transformation rules. We present a framework for the abstraction of graphs sup...

متن کامل

Modularized Morphing of Neural Networks

In this work we study the problem of network morphism, an effective learning scheme to morph a well-trained neural network to a new one with the network function completely preserved. Different from existing work where basic morphing types on the layer level were addressed, we target at the central problem of network morphism at a higher level, i.e., how a convolutional layer can be morphed int...

متن کامل

A RELATION BETWEEN THE CATEGORIES Set * , SetT, Set AND SetT

In this article, we have shown, for the add-point monad T, thepartial morphism category Set*is isomorphic to the Kleisli category SetT. Alsowe have proved that the category, SetT, of T-algebras is isomorphic to thecategory Set of pointed sets. Finally we have established commutative squaresinvolving these categories.

متن کامل

Discrete Event Model Verification Using System Morphism

Model verification is to check the correctness of the model implementation comparing with a model specification. The specification is modeling and description properties of a real system. The implementation is the ready to simulation model described from model specification. Our proposed frame work is system morphism based approach, which has various levels of morphism depending on system descr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016